# 在 O(n log n) 时间复杂度和常数级空间复杂度下，对链表进行排序。
#
#  示例 1:
#
#  输入: 4->2->1->3
# 输出: 1->2->3->4
#
#
#  示例 2:
#
#  输入: -1->5->3->4->0
# 输出: -1->0->3->4->5
#  Related Topics 排序 链表
#  👍 712 👎 0


# leetcode submit region begin(Prohibit modification and deletion)
# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
from myself.listnode import ListNode


class Solution:
    def sortList(self, head: ListNode) -> ListNode:
        

# leetcode submit region end(Prohibit modification and deletion)
